Incentive-based Robust Reputation Mechanism for P2p Services Emmanuelle Anceaume and Aina Ravoaja

نویسندگان

  • Emmanuelle Anceaume
  • Aina Ravoaja
چکیده

In this paper, we address the problem of designing a robust reputation mechanism for peer-to-peer services. The mechanism we propose achieves high robustness against malicious peers (from individual or collusive ones) and provides incentive for participation. We show that the quality of the reputation value of trustworthy and participating peers is always better than the one of cheating and non participating ones. Finally we formally prove that, even when a high fraction of peers of the system exhibits a collusive behavior, a correct peer can still compute an accurate reputation mechanism towards a server, at the expense of a reasonable convergence time. Key-words: peer-to-peer, reputation, ballot stu ng, bad mouthing, opinions, incentive

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Incentive-Based Robust Reputation Mechanism for P2P Services

In this paper, we address the problem of designing a robust reputation mechanism for peer-to-peer services. The mechanism we propose achieves high robustness against malicious peers (from individual or collusive ones) and provides incentive for participation. We show that the quality of the reputation value of trustworthy and participating peers is always better than the one of cheating and non...

متن کامل

Extending Signatures of Reputation

Reputation mechanisms are a powerful tool to reduce the potential risk of interacting with almost or completely unknown users in environments in which there is no incentive to behave trustworthily, e.g. in open and large-scale systems. However, by collecting feedback about users, reputation mechanisms can easily be manipulated to deduce users’ profiles; thus, these mechanisms jeopardize users’ ...

متن کامل

Agent-based Modeling for Differentiated Admission in P2P systems Using Evolutionary Game Theory Focused on Ownership Reputation

P2P systems, which are composed of unknown agents, have many problems in data sharing and creating. The main problem is concerned with the absence of the proper incentive mechanism for cooperating and feeding the systems. If the participants of P2P systems are not supported by proper incentives for data sharing and creating, the systems will starve from resources through extinction of sharers a...

متن کامل

GGRA: a grouped gossip-based reputation aggregation algorithm

An important issue in P2P networks is the existence of malicious nodes that decreases the performance of such networks. Reputation system in which nodes are ranked based on their behavior, is one of the proposed solutions to detect and isolate malicious (low ranked) nodes. Gossip Trust is an interesting previously proposed algorithm for reputation aggregation in P2P networks based on t...

متن کامل

MegaTorrent: An Incentive-Based Solution to Freeriding in P2P File-Sharing Networks

We present MegaTorrent, a modification of BitTorrent that eliminates freeriding without artificially restricting system efficiency. It relies on a notion of “reputation” similar to that in the “EigenTrust” Algorithm or in Google’s PageRank: users improve their reputation by uploading to peers with high reputations, and as a result, having a high reputation becomes desirable. We prove that given...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006